On the Convexity of Precedence Sequencing Games
نویسندگان
چکیده
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.
منابع مشابه
A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملOn the convexity of games corresponding to sequencing situations with due dates
This paper considers sequencing situations with due date criteria. Three di erent types of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.
متن کاملOn the Extreme Points of the Core of Neighbour Games and Assignment Games
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of assignment games and the class of line graph restricted games yields the class of neighbour games. Further, w...
متن کاملOn Superadditivity and Convexity for Cooperative Games with Random Payoffs
In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off joining a larger coalition) and coalitional-merge convexity (any coalition of players is better of...
متن کاملConvexity of fuzzy coalition games
The deterministic coalition game theory is based on the presumption that all expected incomes of coalitions and individual players are exactly known even befor the bargaining process If we leave this presumption then we extend the original gamemodel into the fuzzy coalition game with vague i e fuzzy pay o s The vagueness of the pay o s leads to vagueness of some other concepts and prop erties l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 137 شماره
صفحات -
تاریخ انتشار 2005